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 listNov 11, 2026 23:14Damir ZainullinDamir ZainullinScore: 77,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2026 23:1577,176652,297,076581,393,00059,168,0002,113,536
2Nov 11, 2026 23:1577,258652,158,614582,077,00059,172,0002,113,536
3Nov 11, 2026 23:1577,284653,129,466582,224,00059,236,0002,113,536
4Nov 11, 2026 23:1577,339652,837,450583,259,00058,660,0002,113,536
5Nov 11, 2026 23:1577,490654,600,802584,241,00058,932,0002,113,536
6Nov 11, 2026 23:1577,629655,239,837584,990,00059,335,0002,113,536
7Nov 11, 2026 23:1577,746656,254,352585,907,00059,387,0002,113,536
8Nov 11, 2026 23:1577,758656,381,440586,032,00059,367,0002,113,536
9Nov 11, 2026 23:1577,921658,145,720587,149,00059,598,0002,113,536