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 listAug 18, 2026 08:09boop34boop34Score: 9,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 08:109,01584,596,69473,583,0001,242,0002,113,536
2Aug 18, 2026 08:109,04384,944,78873,903,0001,155,0002,113,536
3Aug 18, 2026 08:109,05585,011,27373,936,0001,221,0002,113,536
4Aug 18, 2026 08:109,05885,028,62273,982,0001,202,0002,113,536
5Aug 18, 2026 08:109,06086,261,34974,083,0001,121,0002,113,536
6Aug 18, 2026 08:109,06385,133,68873,982,0001,249,0002,113,536
7Aug 18, 2026 08:109,06585,825,78474,041,0001,201,0002,113,536
8Aug 18, 2026 08:109,07185,583,26274,069,0001,224,0002,113,536
9Aug 18, 2026 08:109,18486,847,86375,004,0001,226,0002,113,536