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 29, 2026 16:00Victor MerckléVictor MerckléScore: 3,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 16:013,64339,264,91429,114,0001,123,0002,117,632stderr
2Aug 29, 2026 16:013,65338,706,39529,129,0001,195,0002,117,632stderr
3Aug 29, 2026 16:013,66638,870,03729,303,0001,126,0002,117,632stderr
4Aug 29, 2026 16:013,66739,546,70729,292,0001,150,0002,117,632stderr
5Aug 29, 2026 16:013,68139,643,59029,424,0001,132,0002,117,632stderr
6Aug 29, 2026 16:013,68538,882,36829,498,0001,092,0002,117,632stderr
7Aug 29, 2026 16:013,69339,052,22129,497,0001,160,0002,117,632stderr
8Aug 29, 2026 16:013,69739,716,46829,536,0001,150,0002,117,632stderr
9Aug 29, 2026 16:013,72639,945,56329,799,0001,134,0002,117,632stderr