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 11, 2026 17:55Victor MerckléVictor MerckléScore: 4,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 17:564,45945,317,14935,954,0001,062,0002,117,632stderr
2Aug 11, 2026 17:564,46145,281,00235,986,0001,047,0002,117,632stderr
3Aug 11, 2026 17:564,46245,280,26935,933,0001,104,0002,117,632stderr
4Aug 11, 2026 17:564,47545,434,57536,027,0001,118,0002,117,632stderr
5Aug 11, 2026 17:564,47645,483,78636,113,0001,038,0002,117,632stderr
6Aug 11, 2026 17:564,47945,326,48436,135,0001,048,0002,117,632stderr
7Aug 11, 2026 17:564,48245,350,51836,164,0001,037,0002,117,632stderr
8Aug 11, 2026 17:564,48846,307,32836,151,0001,107,0002,117,632stderr
9Aug 11, 2026 17:564,69248,005,80237,910,0001,041,0002,117,632stderr