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 listFeb 11, 2026 18:31olliecrowolliecrowScore: 6,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:316,04374,412,39946,141,0004,012,0002,506,752
2Feb 11, 2026 18:316,04782,775,06647,179,0003,011,0002,506,752
3Feb 11, 2026 18:316,09576,735,94347,555,0003,035,0002,506,752
4Feb 11, 2026 18:316,37081,376,03950,875,0001,995,0002,347,008
5Feb 11, 2026 18:316,43280,883,17849,354,0004,028,0002,363,392
6Feb 11, 2026 18:316,50479,952,21849,987,0003,999,0002,465,792