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 19, 2026 16:56Daniel MastalerzDaniel MastalerzScore: 8,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 16:568,28994,571,28366,806,0001,994,0002,297,856
2Feb 19, 2026 16:568,29495,629,47667,843,000997,0002,338,816
3Feb 19, 2026 16:568,29495,606,98065,848,0002,993,0002,433,024
4Feb 19, 2026 16:568,45795,202,74169,187,0001,002,0002,330,624
5Feb 19, 2026 16:568,45793,429,58668,191,0002,005,0002,330,624
6Feb 19, 2026 16:568,47593,518,60768,336,0002,009,0002,326,528