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 listJan 1, 2026 20:07Josu San MartinJosu San MartinScore: 7,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:077,12084,801,09157,090,0002,003,0002,457,600
2Jan 1, 2026 20:077,12388,307,08856,118,0003,006,0002,375,680
3Jan 1, 2026 20:077,13179,852,12654,172,0005,015,0002,326,528
4Jan 1, 2026 20:077,37781,596,38558,222,0003,011,0002,293,760
5Jan 1, 2026 20:077,40384,262,16258,425,0003,021,0002,326,528
6Jan 1, 2026 20:077,42085,653,64160,578,0001,009,0002,392,064