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 listMar 10, 2026 17:52Josu San MartinJosu San MartinScore: 5,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 17:525,30868,141,96442,057,0002,002,0002,281,472
2Mar 10, 2026 17:525,36870,890,50343,543,0001,012,0002,281,472
3Mar 10, 2026 17:525,47067,425,38144,392,0001,008,0002,281,472
4Mar 10, 2026 17:525,48571,050,90544,513,0001,011,0002,379,776
5Mar 10, 2026 17:525,55372,356,47144,085,0002,003,0002,371,584
6Mar 10, 2026 17:525,58170,936,28644,312,0002,014,0002,281,472