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 21, 2026 13:52Daniel MastalerzDaniel MastalerzScore: 5,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 13:535,62272,516,80843,684,0002,978,0002,326,528
2Feb 21, 2026 13:535,62373,962,24444,642,0002,029,0002,326,528
3Feb 21, 2026 13:525,63473,077,76243,775,0002,984,0002,523,136
4Feb 21, 2026 13:525,63976,744,74543,816,0002,987,0002,269,184
5Feb 21, 2026 13:525,63973,415,69942,818,0003,983,0002,269,184
6Feb 21, 2026 13:535,66476,912,03844,008,0003,000,0002,265,088
7Feb 21, 2026 13:525,68070,254,61143,136,0004,012,0002,265,088
8Feb 21, 2026 13:525,68769,368,62044,191,0003,013,0002,269,184
9Feb 21, 2026 13:525,69172,452,00643,216,0004,020,0002,318,336