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 24, 2026 19:50Victor MerckléVictor MerckléScore: 4,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 19:514,51245,273,79736,334,0001,123,0002,117,632stderr
2Jun 24, 2026 19:514,51345,651,83136,349,0001,116,0002,117,632stderr
3Jun 24, 2026 19:514,51745,009,76436,379,0001,119,0002,117,632stderr
4Jun 24, 2026 19:514,52045,580,96836,416,0001,101,0002,117,632stderr
5Jun 24, 2026 19:514,52545,265,69936,433,0001,132,0002,117,632stderr
6Jun 24, 2026 19:514,53045,722,74236,517,0001,090,0002,117,632stderr
7Jun 24, 2026 19:514,54545,177,42736,636,0001,091,0002,117,632stderr
8Jun 24, 2026 19:514,55045,787,47536,728,0001,041,0002,117,632stderr
9Jun 24, 2026 19:514,55445,652,17236,701,0001,103,0002,117,632stderr