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 05:12Victor MerckléVictor MerckléScore: 8,141Success
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 05:138,07975,115,93765,941,0001,115,0002,117,632stderr
2Jun 24, 2026 05:138,10275,274,47966,118,0001,130,0002,117,632stderr
3Jun 24, 2026 05:138,10775,724,59466,166,0001,123,0002,117,632stderr
4Jun 24, 2026 05:138,13975,401,22866,445,0001,116,0002,117,632stderr
5Jun 24, 2026 05:138,14175,315,99166,552,0001,020,0002,117,632stderr
6Jun 24, 2026 05:138,14275,338,72866,470,0001,112,0002,117,632stderr
7Jun 24, 2026 05:138,33276,823,08468,041,0001,121,0002,117,632stderr
8Jun 24, 2026 05:138,33776,969,51768,058,0001,144,0002,117,632stderr
9Jun 24, 2026 05:138,37777,526,80368,426,0001,107,0002,117,632stderr