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 listJun 11, 2026 21:29Victor MerckléVictor MerckléScore: 4,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 21:304,56747,027,65936,814,0001,098,0002,113,536
2Jun 11, 2026 21:304,57645,675,18736,976,0001,013,0002,113,536
3Jun 11, 2026 21:304,58045,755,50237,004,0001,018,0002,113,536
4Jun 11, 2026 21:304,58345,737,59536,923,0001,117,0002,113,536
5Jun 11, 2026 21:304,58445,731,80237,034,0001,020,0002,113,536
6Jun 11, 2026 21:304,58945,805,99137,073,0001,021,0002,113,536
7Jun 11, 2026 21:304,60145,901,69637,159,0001,033,0002,113,536
8Jun 11, 2026 21:304,60345,884,57637,176,0001,032,0002,113,536
9Jun 11, 2026 21:304,62346,058,16937,351,0001,026,0002,113,536