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 16:22Teow Hua JunTeow Hua JunScore: 8,072Success
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 16:238,06176,770,83465,895,0001,018,0002,117,632stderr
2Aug 3, 2026 16:238,06276,684,87865,635,0001,280,0002,117,632stderr
3Aug 3, 2026 16:238,06576,980,75765,666,0001,278,0002,117,632stderr
4Aug 3, 2026 16:238,07077,486,82565,973,0001,011,0002,117,632stderr
5Aug 3, 2026 16:238,07276,837,81565,994,0001,009,0002,117,632stderr
6Aug 3, 2026 16:238,07276,885,97465,991,0001,013,0002,117,632stderr
7Aug 3, 2026 16:238,07476,802,31666,003,0001,012,0002,117,632stderr
8Aug 3, 2026 16:238,07676,876,03066,020,0001,011,0002,117,632stderr
9Aug 3, 2026 16:238,07976,862,91466,045,0001,011,0002,117,632stderr