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 listAug 31, 2026 10:49Victor MerckléVictor MerckléScore: 4,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 10:494,29944,218,59834,577,0001,110,0002,113,536
2Aug 31, 2026 10:494,30244,113,48434,612,0001,099,0002,113,536
3Aug 31, 2026 10:494,30244,063,15234,615,0001,099,0002,113,536
4Aug 31, 2026 10:494,30344,173,09734,614,0001,102,0002,113,536
5Aug 31, 2026 10:494,30544,872,65034,652,0001,083,0002,113,536
6Aug 31, 2026 10:494,31044,218,18234,644,0001,134,0002,113,536
7Aug 31, 2026 10:494,31344,308,32534,717,0001,082,0002,113,536
8Aug 31, 2026 10:494,31344,151,48934,756,0001,042,0002,113,536
9Aug 31, 2026 10:494,33244,306,49634,837,0001,122,0002,113,536