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 listMay 4, 2026 23:02olliecrowolliecrowScore: 6,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:035,92973,045,48547,024,0002,189,0002,342,912
2May 4, 2026 23:035,93955,973,05547,097,0002,200,0002,338,816
3May 4, 2026 23:035,98977,705,85847,642,0002,068,0002,347,008
4May 4, 2026 23:036,01456,339,16647,768,0002,150,0002,310,144
5May 4, 2026 23:036,02670,443,94147,871,0002,148,0002,428,928
6May 4, 2026 23:036,04956,646,09547,967,0002,245,0002,510,848
7May 4, 2026 23:036,07058,022,16548,260,0002,125,0002,322,432
8May 4, 2026 23:036,11257,152,57548,659,0002,077,0002,355,200
9May 4, 2026 23:036,14258,329,73148,726,0002,259,0002,564,096