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 18:24Daniel MastalerzDaniel MastalerzScore: 5,674Success
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 18:245,55467,978,82342,094,0004,008,0002,523,136
2Feb 21, 2026 18:245,59767,681,12442,418,0004,039,0002,322,432
3Feb 21, 2026 18:245,61872,246,29243,589,0003,041,0002,363,392
4Feb 21, 2026 18:245,67469,743,06543,089,0004,008,0002,297,856
5Feb 21, 2026 18:245,67873,242,03243,117,0004,010,0002,506,752
6Feb 21, 2026 18:245,68071,695,08643,131,0004,012,0002,314,240