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 28, 2026 18:56Victor MerckléVictor MerckléScore: 5,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 18:575,95258,473,22147,286,0002,116,0002,117,632stderr
2Aug 28, 2026 18:575,96358,522,31047,396,0002,098,0002,117,632stderr
3Aug 28, 2026 18:575,97558,632,19347,454,0002,139,0002,117,632stderr
4Aug 28, 2026 18:575,98658,086,31947,546,0002,144,0002,117,632stderr
5Aug 28, 2026 18:575,98758,711,67147,576,0002,117,0002,117,632stderr
6Aug 28, 2026 18:576,00458,938,91247,723,0002,116,0002,117,632stderr
7Aug 28, 2026 18:576,02459,095,58047,827,0002,177,0002,117,632stderr
8Aug 28, 2026 18:576,03659,179,64047,929,0002,176,0002,117,632stderr
9Aug 28, 2026 18:576,03959,108,10847,967,0002,159,0002,117,632stderr