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 listMay 10, 2026 10:09wnwnScore: 3,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:093,39343,390,16627,129,0001,036,0002,478,080
2May 10, 2026 10:093,40246,916,27527,178,0001,061,0002,482,176
3May 10, 2026 10:093,40544,667,42327,203,0001,061,0002,490,368
4May 10, 2026 10:093,41943,531,28527,301,0001,084,0002,490,368
5May 10, 2026 10:093,43745,774,45027,436,0001,099,0002,486,272
6May 10, 2026 10:093,45544,948,66027,597,0001,080,0002,486,272
7May 10, 2026 10:093,50844,504,34928,032,0001,090,0002,322,432
8May 10, 2026 10:093,61342,532,11928,949,0001,045,0002,486,272
9May 10, 2026 10:093,61945,463,21128,953,0001,086,0002,486,272