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 15, 2026 19:40Eric CeglieEric CeglieScore: 13,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:4013,525137,950,543105,244,0007,016,0002,441,216
2Mar 15, 2026 19:4013,555132,194,893103,464,0009,040,0002,338,816
3Mar 15, 2026 19:4013,588142,097,631103,802,0008,982,0002,490,368
4Mar 15, 2026 19:4013,646138,019,031101,236,00012,028,0002,408,448
5Mar 15, 2026 19:4013,660136,898,706104,345,0009,029,0002,285,568
6Mar 15, 2026 19:4013,665137,230,893105,393,0008,029,0002,318,336
7Mar 15, 2026 19:4013,682138,031,638103,512,00010,049,0002,269,184
8Mar 15, 2026 19:4013,700142,620,334103,735,0009,974,0002,404,352
9Mar 15, 2026 19:4013,716138,524,931106,856,0006,990,0002,273,280