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 listSep 6, 2026 09:01Kevin HeaveyKevin HeaveyScore: 3,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:023,51537,789,15427,923,0001,254,0002,113,536
2Sep 6, 2026 09:023,52637,921,19628,214,0001,058,0002,113,536
3Sep 6, 2026 09:023,53937,980,45128,341,0001,036,0002,113,536
4Sep 6, 2026 09:023,54137,976,85028,303,0001,093,0002,113,536
5Sep 6, 2026 09:023,54337,905,22328,330,0001,079,0002,113,536
6Sep 6, 2026 09:023,54337,866,69228,359,0001,050,0002,113,536
7Sep 6, 2026 09:023,56037,986,90928,450,0001,106,0002,113,536
8Sep 6, 2026 09:023,57338,223,34228,596,0001,065,0002,113,536
9Sep 6, 2026 09:023,59738,356,79628,801,0001,059,0002,113,536