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 8, 2026 20:18Damir ZainullinDamir ZainullinScore: 89,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 20:1888,994749,426,162679,996,00058,662,0002,113,536
2Nov 8, 2026 20:1889,005749,541,518679,995,00058,748,0002,113,536
3Nov 8, 2026 20:1889,008749,561,920680,008,00058,766,0002,113,536
4Nov 8, 2026 20:1889,041750,114,059679,777,00059,270,0002,113,536
5Nov 8, 2026 20:1889,042749,710,358680,123,00058,927,0002,113,536
6Nov 8, 2026 20:1889,054749,839,473680,150,00059,003,0002,113,536
7Nov 8, 2026 20:1889,078750,026,186680,405,00058,943,0002,113,536
8Nov 8, 2026 20:1889,124750,408,435680,235,00059,501,0002,113,536
9Nov 8, 2026 20:1889,128750,516,199680,396,00059,367,0002,113,536