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 listMay 19, 2026 14:57Victor MerckléVictor MerckléScore: 5,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:585,86259,256,89847,632,0001,027,0002,117,632stderr
2May 19, 2026 14:585,86357,844,19147,645,0001,025,0002,117,632stderr
3May 19, 2026 14:585,89858,059,85247,946,0001,015,0002,117,632stderr
4May 19, 2026 14:585,89956,694,03447,947,0001,022,0002,117,632stderr
5May 19, 2026 14:585,93159,324,70648,220,0001,015,0002,117,632stderr
6May 19, 2026 14:585,99857,524,05548,781,0001,005,0002,117,632stderr
7May 19, 2026 14:586,01858,619,11048,929,0001,021,0002,117,632stderr
8May 19, 2026 14:586,05559,132,79449,233,0001,025,0002,117,632stderr
9May 19, 2026 14:586,20360,491,20450,449,0001,037,0002,117,632stderr