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 16, 2026 23:48Andrew EpsteinAndrew EpsteinScore: 4,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:484,30845,977,84234,654,0001,109,0002,113,536
2Sep 16, 2026 23:484,33346,359,74334,850,0001,116,0002,113,536
3Sep 16, 2026 23:484,34546,224,66534,963,0001,105,0002,113,536
4Sep 16, 2026 23:484,34746,918,80034,974,0001,110,0002,113,536
5Sep 16, 2026 23:484,35246,226,31935,007,0001,121,0002,113,536
6Sep 16, 2026 23:484,37746,496,63335,213,0001,122,0002,113,536
7Sep 16, 2026 23:484,38246,536,40535,261,0001,111,0002,113,536
8Sep 16, 2026 23:484,45947,238,61035,863,0001,152,0002,113,536
9Sep 16, 2026 23:484,59249,008,78037,001,0001,115,0002,113,536