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 3, 2026 12:51Andrew EpsteinAndrew EpsteinScore: 3,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 12:523,39637,493,74028,193,000020,480
2Nov 3, 2026 12:523,40137,520,67428,235,000020,480
3Nov 3, 2026 12:523,42537,779,62828,430,000020,480
4Nov 3, 2026 12:523,44137,829,61828,563,000020,480
5Nov 3, 2026 12:523,44337,823,96828,578,000020,480
6Nov 3, 2026 12:523,46037,661,20328,721,000020,480
7Nov 3, 2026 12:523,46138,072,91827,724,0001,010,00020,480
8Nov 3, 2026 12:523,46638,077,77928,773,000020,480
9Nov 3, 2026 12:523,48038,155,90228,887,000020,480