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 listSep 24, 2026 03:32wnwnScore: 3,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:333,45238,013,71227,383,0001,274,00020,480
2Sep 24, 2026 03:333,49637,768,78227,570,0001,452,0002,113,536
3Sep 24, 2026 03:333,50237,823,75227,659,0001,414,0002,113,536
4Sep 24, 2026 03:333,55938,351,97327,775,0001,768,0002,113,536
5Sep 24, 2026 03:333,56638,570,72928,408,0001,190,00020,480
6Sep 24, 2026 03:333,67239,916,67728,921,0001,560,0002,113,536
7Sep 24, 2026 03:333,76040,046,38327,566,0003,642,0002,113,536
8Sep 24, 2026 03:333,82241,187,65228,191,0003,534,0002,113,536
9Sep 24, 2026 03:333,83440,895,79929,306,0002,518,00020,480