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 23, 2026 17:50Victor MerckléVictor MerckléScore: 3,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:513,74939,563,89730,009,0001,111,0002,117,632stderr
2Aug 23, 2026 17:513,75440,247,37130,038,0001,126,0002,117,632stderr
3Aug 23, 2026 17:513,75839,568,67730,112,0001,082,0002,117,632stderr
4Aug 23, 2026 17:513,76441,294,29230,136,0001,112,0002,117,632stderr
5Aug 23, 2026 17:513,77439,793,73530,182,0001,148,0002,117,632stderr
6Aug 23, 2026 17:513,77539,702,09330,256,0001,082,0002,117,632stderr
7Aug 23, 2026 17:513,78939,930,99230,430,0001,022,0002,117,632stderr
8Aug 23, 2026 17:513,83340,150,05330,622,0001,195,0002,117,632stderr
9Aug 23, 2026 17:514,01341,682,47332,262,0001,049,0002,117,632stderr