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 listMar 2, 2026 15:17caandocaandoScore: 5,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:175,60166,531,96446,487,00002,285,568
2Mar 2, 2026 15:175,61378,685,79345,572,0001,012,0002,510,848
3Mar 2, 2026 15:175,61475,895,83845,586,0001,013,0002,285,568
4Mar 2, 2026 15:175,67372,453,12846,083,0001,001,0002,285,568
5Mar 2, 2026 15:175,71670,638,43946,434,0001,009,0002,273,280
6Mar 2, 2026 15:175,72368,748,76946,491,0001,010,0002,269,184