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 listFeb 18, 2026 10:10wnwnScore: 7,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:106,23980,393,09347,799,0003,983,0002,519,040
2Feb 18, 2026 10:106,28277,413,69449,135,0003,008,0002,494,464
3Feb 18, 2026 10:106,40182,354,55450,121,0003,007,0002,375,680
4Feb 18, 2026 10:107,15082,640,09156,331,0003,017,0002,273,280
5Feb 18, 2026 10:107,25182,062,00857,172,0003,009,0002,387,968
6Feb 18, 2026 10:107,26282,322,06758,262,0002,009,0002,461,696