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:10Victor MerckléVictor MerckléScore: 7,029Success
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:116,97866,934,97456,764,0001,159,0002,117,632stderr
2Aug 26, 2026 21:117,00366,496,68157,049,0001,078,0002,117,632stderr
3Aug 26, 2026 21:117,01766,662,47057,079,0001,168,0002,117,632stderr
4Aug 26, 2026 21:117,02266,679,75257,143,0001,146,0002,117,632stderr
5Aug 26, 2026 21:117,02966,748,12157,261,0001,086,0002,117,632stderr
6Aug 26, 2026 21:117,05166,860,28957,431,0001,093,0002,117,632stderr
7Aug 26, 2026 21:117,14267,573,48258,130,0001,151,0002,117,632stderr
8Aug 26, 2026 21:117,20568,876,71758,663,0001,143,0002,117,632stderr
9Aug 26, 2026 21:117,24468,698,04159,011,0001,116,0002,117,632stderr