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 listMar 9, 2026 20:32wnwnScore: 4,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 20:324,80361,362,36437,872,0001,993,0002,494,464
2Mar 9, 2026 20:324,81160,809,61137,938,0001,996,0002,502,656
3Mar 9, 2026 20:344,83359,642,53638,107,0002,005,0002,494,464
4Mar 9, 2026 20:344,83761,699,09638,140,0002,007,0002,494,464
5Mar 9, 2026 20:344,87165,830,81339,418,0001,010,0002,486,272
6Mar 9, 2026 20:324,87762,715,84139,465,0001,011,0002,273,280