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 listFeb 23, 2026 14:03satoru.netsatoru.netScore: 67,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 14:0367,485585,462,065501,116,00059,013,0002,392,064
2Feb 23, 2026 14:0367,660585,412,023500,621,00060,953,0002,404,352
3Feb 23, 2026 14:0367,758584,331,303501,458,00060,934,0002,265,088