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 4, 2026 09:13Teow Hua JunTeow Hua JunScore: 6,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 09:146,60064,821,43353,771,0001,017,0002,113,536
2Aug 4, 2026 09:146,60064,747,23053,656,0001,125,0002,113,536
3Aug 4, 2026 09:146,60665,041,33253,698,0001,138,0002,113,536
4Aug 4, 2026 09:146,60970,153,46453,718,0001,137,0002,113,536
5Aug 4, 2026 09:146,67466,146,00254,261,0001,141,0002,113,536
6Aug 4, 2026 09:146,69165,583,61754,405,0001,138,0002,113,536
7Aug 4, 2026 09:146,69566,400,85954,448,0001,128,0002,113,536
8Aug 4, 2026 09:146,69966,360,01354,453,0001,151,0002,113,536
9Aug 4, 2026 09:146,70566,345,46654,525,0001,130,0002,113,536