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 24, 2026 19:34Victor MerckléVictor MerckléScore: 4,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:354,62847,202,65637,313,0001,104,0002,117,632stderr
2Aug 24, 2026 19:354,63046,756,14837,384,0001,052,0002,117,632stderr
3Aug 24, 2026 19:354,67147,157,85637,677,0001,094,0002,117,632stderr
4Aug 24, 2026 19:354,70247,453,98537,919,0001,108,0002,117,632stderr
5Aug 24, 2026 19:354,70347,437,39737,968,0001,075,0002,117,632stderr
6Aug 24, 2026 19:354,70447,415,73637,983,0001,065,0002,117,632stderr
7Aug 24, 2026 19:354,89849,034,34339,543,0001,111,0002,117,632stderr
8Aug 24, 2026 19:354,90049,056,55639,634,0001,036,0002,117,632stderr
9Aug 24, 2026 19:355,11350,991,62841,377,0001,065,0002,117,632stderr