Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 2, 2026 01:02Karthik ReddyKarthik ReddyScore: 3,315Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 01:043,3006,036,671,14927,390,000020,480
2Oct 2, 2026 01:043,3076,036,645,40127,449,000020,480
3Oct 2, 2026 01:043,3126,036,812,52626,479,0001,013,00020,480
4Oct 2, 2026 01:043,3146,036,729,74027,510,000020,480
5Oct 2, 2026 01:043,3156,036,768,86227,518,000020,480
6Oct 2, 2026 01:043,3296,036,821,89126,626,0001,005,00020,480
7Oct 2, 2026 01:043,3336,036,915,80426,631,0001,033,00020,480
8Oct 2, 2026 01:043,3486,036,938,22926,787,0001,006,00020,480
9Oct 2, 2026 01:043,4066,037,513,12128,270,000020,480