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 listApr 26, 2026 13:35wnwnScore: 3,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:353,39850,912,49927,200,0001,007,0002,490,368
2Apr 26, 2026 13:353,42544,601,70327,414,0001,015,0002,490,368
3Apr 26, 2026 13:353,42744,097,98127,430,0001,015,0002,314,240
4Apr 26, 2026 13:353,43147,652,96027,464,0001,017,0002,330,624
5Apr 26, 2026 13:353,43943,213,09127,532,0001,019,0002,490,368
6Apr 26, 2026 13:353,44040,918,51327,538,0001,019,0002,330,624
7Apr 26, 2026 13:353,44143,133,48428,561,00002,330,624
8Apr 26, 2026 13:353,45844,933,71726,728,0001,979,0002,486,272
9Apr 26, 2026 13:353,47945,473,73626,888,0001,991,0002,490,368