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 3, 2026 15:17Teow Hua JunTeow Hua JunScore: 9,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 15:189,50088,783,80477,759,0001,095,0002,117,632stderr
2Aug 3, 2026 15:189,50188,758,40277,758,0001,108,0002,117,632stderr
3Aug 3, 2026 15:189,50288,698,70177,783,0001,084,0002,117,632stderr
4Aug 3, 2026 15:189,50388,688,81877,776,0001,101,0002,117,632stderr
5Aug 3, 2026 15:189,50488,681,66677,786,0001,104,0002,117,632stderr
6Aug 3, 2026 15:189,50488,796,16077,773,0001,111,0002,117,632stderr
7Aug 3, 2026 15:189,51188,875,79077,844,0001,102,0002,117,632stderr
8Aug 3, 2026 15:189,52089,016,32677,790,0001,230,0002,117,632stderr
9Aug 3, 2026 15:189,52588,892,53777,953,0001,106,0002,117,632stderr