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 23, 2026 13:45satoru.netsatoru.netScore: 91,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 13:4590,400777,025,113518,528,000231,789,0002,514,944
2Feb 23, 2026 13:4590,644783,702,172520,548,000231,798,0002,523,136
3Feb 23, 2026 13:4590,727778,701,043521,330,000231,702,0002,359,296
4Feb 23, 2026 13:4590,914787,031,312521,713,000232,872,0002,326,528
5Feb 23, 2026 13:4591,095781,567,879520,373,000235,716,0002,387,968
6Feb 23, 2026 13:4591,102782,622,012520,414,000235,734,0002,514,944
7Feb 23, 2026 13:4591,145782,518,075520,661,000235,846,0002,342,912
8Feb 23, 2026 13:4591,242789,676,455520,524,000236,783,0002,506,752
9Feb 23, 2026 13:4591,464788,237,847521,415,000237,733,0002,359,296