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 listJul 21, 2026 06:49Kevin HeaveyKevin HeaveyScore: 3,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 06:513,62839,727,40829,066,0001,048,0002,113,536
2Jul 21, 2026 06:513,64039,913,56529,169,0001,047,0002,113,536
3Jul 21, 2026 06:513,64139,831,35329,172,0001,049,0002,113,536
4Jul 21, 2026 06:513,65739,988,20029,309,0001,051,0002,113,536
5Jul 21, 2026 06:513,66140,068,61529,338,0001,053,0002,113,536
6Jul 21, 2026 06:513,78341,024,01330,353,0001,048,0002,113,536
7Jul 21, 2026 06:513,87041,709,47231,079,0001,048,0002,113,536
8Jul 21, 2026 06:513,92042,160,99631,496,0001,043,0002,113,536
9Jul 21, 2026 06:513,92442,446,95231,533,0001,044,0002,113,536