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 30, 2025 02:47Marco BarboneMarco BarboneScore: 123,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 02:47122,8801,040,194,6321,018,902,000999,0002,273,280
2Jul 30, 2025 02:47123,0271,050,955,1351,019,123,0001,998,0002,285,568
3Jul 30, 2025 02:47126,4841,077,725,6061,047,820,0001,999,0002,277,376