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:16Teow Hua JunTeow Hua JunScore: 10,781Success
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:1610,77899,324,65288,393,0001,069,0002,113,536
2Aug 3, 2026 15:1610,78099,295,57488,393,0001,087,0002,113,536
3Aug 3, 2026 15:1610,78199,395,08788,403,0001,084,0002,113,536
4Aug 3, 2026 15:1610,78199,392,18888,409,0001,080,0002,113,536
5Aug 3, 2026 15:1610,78199,271,92988,398,0001,086,0002,113,536
6Aug 3, 2026 15:1610,78499,354,44788,387,0001,126,0002,113,536
7Aug 3, 2026 15:1610,78599,421,99588,421,0001,095,0002,113,536
8Aug 3, 2026 15:1610,78799,368,86888,445,0001,091,0002,113,536
9Aug 3, 2026 15:1610,78799,429,44188,398,0001,136,0002,113,536