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 11, 2026 20:03kuba1803kuba1803Score: 87,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 20:0387,045731,451,070663,319,00059,160,0002,113,536
2Jun 11, 2026 20:0387,092731,907,305663,612,00059,254,0002,113,536
3Jun 11, 2026 20:0387,119732,103,147663,393,00059,697,0002,113,536
4Jun 11, 2026 20:0387,125732,180,599663,779,00059,364,0002,113,536
5Jun 11, 2026 20:0387,127732,131,472662,965,00060,197,0002,113,536
6Jun 11, 2026 20:0387,140732,341,192664,256,00059,011,0002,113,536
7Jun 11, 2026 20:0387,163732,495,810663,588,00059,872,0002,113,536
8Jun 11, 2026 20:0387,203732,981,784664,390,00059,403,0002,113,536
9Jun 11, 2026 20:0387,245733,059,689663,554,00060,585,0002,113,536