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 17:01satoru.netsatoru.netScore: 36,302Success
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 17:0136,278333,543,705298,104,0003,001,0002,371,584
2Feb 23, 2026 17:0136,302331,434,120300,305,0001,001,0002,387,968
3Feb 23, 2026 17:0136,442330,103,493300,464,0002,003,0002,469,888