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 25, 2026 01:06Victor MerckléVictor MerckléScore: 7,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:076,97466,285,22956,755,0001,135,0002,117,632stderr
2Aug 25, 2026 01:076,99666,825,99457,013,0001,062,0002,117,632stderr
3Aug 25, 2026 01:077,00466,519,54957,003,0001,137,0002,117,632stderr
4Aug 25, 2026 01:077,01566,632,88657,099,0001,131,0002,117,632stderr
5Aug 25, 2026 01:077,02266,711,29657,072,0001,211,0002,117,632stderr
6Aug 25, 2026 01:077,06967,782,84857,522,0001,158,0002,117,632stderr
7Aug 25, 2026 01:077,06967,031,15057,590,0001,086,0002,117,632stderr
8Aug 25, 2026 01:077,20768,234,66358,732,0001,087,0002,117,632stderr
9Aug 25, 2026 01:077,22968,524,40458,905,0001,100,0002,117,632stderr