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 listApr 1, 2026 20:46leoweleoweScore: 65,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 20:4665,062564,381,810477,012,00063,001,0002,379,776
2Apr 1, 2026 20:4665,397567,627,316473,824,00068,974,0002,293,760
3Apr 1, 2026 20:4665,428568,774,940474,043,00069,006,0002,289,664