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 listMay 7, 2026 08:38wnwnScore: 3,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:383,38042,833,23727,011,0001,049,0002,490,368
2May 7, 2026 08:383,38143,803,44827,008,0001,058,0002,490,368
3May 7, 2026 08:383,38443,506,54727,034,0001,057,0002,486,272
4May 7, 2026 08:383,38743,921,75027,043,0001,077,0002,482,176
5May 7, 2026 08:383,42843,354,64327,344,0001,114,0002,482,176
6May 7, 2026 08:383,55645,585,31828,446,0001,075,0002,490,368
7May 7, 2026 08:383,55746,922,11028,418,0001,112,0002,486,272
8May 7, 2026 08:383,55742,497,31728,434,0001,093,0002,490,368
9May 7, 2026 08:383,56844,142,73128,515,0001,106,0002,494,464