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 23, 2026 19:34Victor MerckléVictor MerckléScore: 3,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:343,78739,828,65730,225,0001,214,0002,117,632stderr
2Aug 23, 2026 19:343,79339,813,65230,375,0001,108,0002,117,632stderr
3Aug 23, 2026 19:343,81740,029,29230,528,0001,154,0002,117,632stderr
4Aug 23, 2026 19:343,81940,034,32730,508,0001,197,0002,117,632stderr
5Aug 23, 2026 19:343,83840,918,87130,680,0001,179,0002,117,632stderr
6Aug 23, 2026 19:343,84140,254,11530,833,0001,051,0002,117,632stderr
7Aug 23, 2026 19:343,89840,702,73331,228,0001,126,0002,117,632stderr
8Aug 23, 2026 19:344,03942,603,25532,340,0001,191,0002,117,632stderr
9Aug 23, 2026 19:344,06942,777,66332,667,0001,108,0002,117,632stderr