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 1, 2026 21:54TonyTonyScore: 111,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 21:55111,157932,376,626921,609,0001,001,0002,117,632
2Aug 1, 2026 21:55111,175931,247,566921,757,0001,001,0002,117,632
3Aug 1, 2026 21:55111,176931,195,237921,761,0001,003,0002,117,632
4Aug 1, 2026 21:55111,187931,810,212921,858,0001,002,0002,117,632
5Aug 1, 2026 21:55111,393933,046,978923,563,0001,002,0002,117,632
6Aug 1, 2026 21:55115,062963,553,510954,017,0001,001,0002,117,632
7Aug 1, 2026 21:55116,138972,384,218962,951,0001,002,0002,117,632
8Aug 1, 2026 21:55116,178972,780,075963,281,0001,001,0002,117,632
9Aug 1, 2026 21:55116,182972,734,198963,315,0001,001,0002,117,632