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 26, 2026 21:33Victor MerckléVictor MerckléScore: 3,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:333,75839,522,77330,003,0001,193,0002,117,632stderr
2Aug 26, 2026 21:333,77440,410,00430,104,0001,222,0002,117,632stderr
3Aug 26, 2026 21:333,77439,518,47130,104,0001,228,0002,117,632stderr
4Aug 26, 2026 21:333,78339,794,31530,193,0001,212,0002,117,632stderr
5Aug 26, 2026 21:333,78939,828,84330,256,0001,200,0002,117,632stderr
6Aug 26, 2026 21:333,79539,668,25130,243,0001,257,0002,117,632stderr
7Aug 26, 2026 21:333,79841,404,61730,304,0001,225,0002,117,632stderr
8Aug 26, 2026 21:333,80039,933,94930,306,0001,237,0002,117,632stderr
9Aug 26, 2026 21:333,80140,507,10930,327,0001,226,0002,117,632stderr