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 listApr 26, 2026 13:52wnwnScore: 3,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:533,38949,628,95727,131,0001,004,0002,498,560
2Apr 26, 2026 13:533,40045,431,36827,213,0001,007,0002,486,272
3Apr 26, 2026 13:533,43545,816,02627,493,0001,018,0002,490,368
4Apr 26, 2026 13:533,44041,606,76028,552,00002,478,080
5Apr 26, 2026 13:533,45842,927,60326,727,0001,979,0002,490,368
6Apr 26, 2026 13:533,54944,792,62428,445,0001,015,0002,560,000
7Apr 26, 2026 13:533,56344,016,52528,559,0001,019,0002,490,368
8Apr 26, 2026 13:533,56844,884,52328,594,0001,021,0002,473,984
9Apr 26, 2026 13:533,63346,177,42529,152,0001,005,0002,490,368