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 3, 2026 17:51Josu San MartinJosu San MartinScore: 10,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:5210,42295,888,98679,615,0006,888,0002,121,728
2Jul 3, 2026 17:5210,49597,670,67080,542,0006,573,0002,117,632
3Jul 3, 2026 17:5210,53096,749,54180,815,0006,592,0002,121,728
4Jul 3, 2026 17:5210,55697,042,90380,965,0006,655,0002,117,632
5Jul 3, 2026 17:5210,60297,414,29181,096,0006,903,0002,117,632
6Jul 3, 2026 17:5210,63597,600,45081,418,0006,859,0002,117,632
7Jul 3, 2026 17:5210,63697,610,26981,536,0006,750,0002,117,632
8Jul 3, 2026 17:5210,66198,161,57581,583,0006,911,0002,117,632
9Jul 3, 2026 17:5210,71198,331,70582,034,0006,868,0002,121,728