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:49Teow Hua JunTeow Hua JunScore: 7,858Success
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:507,84875,172,47463,978,0001,168,0002,113,536
2Aug 4, 2026 09:507,85075,195,04564,028,0001,134,0002,113,536
3Aug 4, 2026 09:507,85075,132,44064,001,0001,160,0002,113,536
4Aug 4, 2026 09:507,85475,203,49764,033,0001,157,0002,113,536
5Aug 4, 2026 09:507,85875,293,89864,016,0001,206,0002,113,536
6Aug 4, 2026 09:507,86075,255,87264,037,0001,202,0002,113,536
7Aug 4, 2026 09:507,86376,111,99264,261,0001,010,0002,113,536
8Aug 4, 2026 09:507,88175,423,15064,403,0001,010,0002,113,536
9Aug 4, 2026 09:508,25078,426,72667,333,0001,143,0002,113,536