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 listAug 11, 2026 11:31RabenknechtRabenknechtScore: 51,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:3251,282435,644,802424,594,0001,047,0002,113,536
2Aug 11, 2026 11:3251,550437,938,910426,763,0001,104,0002,113,536
3Aug 11, 2026 11:3251,592438,267,150427,182,0001,035,0002,113,536
4Aug 11, 2026 11:3251,800439,984,408428,849,0001,099,0002,113,536
5Aug 11, 2026 11:3251,847440,530,120429,265,0001,067,0002,113,536
6Aug 11, 2026 11:3252,071442,344,498431,081,0001,112,0002,113,536
7Aug 11, 2026 11:3252,294444,148,400433,009,0001,038,0002,113,536
8Aug 11, 2026 11:3252,332444,496,784433,354,0001,007,0002,113,536
9Aug 11, 2026 11:3252,376444,885,509433,717,0001,004,0002,113,536