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 listJan 2, 2026 15:13Josu San MartinJosu San MartinScore: 6,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 15:136,14976,141,14650,037,0001,000,0002,400,256
2Jan 2, 2026 15:136,15375,494,57349,066,0002,002,0002,273,280
3Jan 2, 2026 15:136,17079,162,03350,203,0001,004,0002,396,160
4Jan 2, 2026 15:136,22177,056,42650,619,0001,012,0002,285,568
5Jan 2, 2026 15:136,27277,717,31351,059,0001,001,0002,285,568
6Jan 2, 2026 15:136,28772,586,92451,177,0001,003,0002,285,568
7Jan 2, 2026 15:136,28874,944,80050,181,0002,007,0002,400,256
8Jan 2, 2026 15:136,39478,223,83352,068,0001,001,0002,285,568
9Jan 2, 2026 15:136,39480,971,47252,072,0001,001,0002,285,568
10Jan 2, 2026 15:136,40478,163,44951,148,0002,005,0002,285,568
11Jan 2, 2026 15:136,47980,268,83151,785,0001,991,0002,285,568
12Jan 2, 2026 15:136,54777,497,91154,340,00002,285,568