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:31Teow Hua JunTeow Hua JunScore: 8,074Success
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:328,06976,819,51765,695,0001,279,0002,113,536
2Aug 3, 2026 16:328,06976,851,06765,703,0001,274,0002,113,536
3Aug 3, 2026 16:328,07176,846,69965,724,0001,272,0002,113,536
4Aug 3, 2026 16:328,07276,865,49165,727,0001,272,0002,113,536
5Aug 3, 2026 16:328,07477,380,53866,010,0001,010,0002,113,536
6Aug 3, 2026 16:328,07676,914,19766,030,0001,008,0002,113,536
7Aug 3, 2026 16:328,07776,900,12066,032,0001,010,0002,113,536
8Aug 3, 2026 16:328,08076,897,29165,783,0001,281,0002,113,536
9Aug 3, 2026 16:328,08576,929,56966,101,0001,011,0002,113,536