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 17, 2026 19:03wnwnScore: 7,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:036,55182,591,84551,355,0003,020,0002,465,792
2Feb 17, 2026 19:036,60479,649,22551,827,0002,990,0002,338,816
3Feb 17, 2026 19:036,65295,888,80351,200,0004,015,0002,506,752
4Feb 17, 2026 19:037,53589,120,95060,522,0002,017,0002,396,160
5Feb 17, 2026 19:037,67388,698,42359,702,0003,980,0002,453,504
6Feb 17, 2026 19:037,76086,030,32961,390,0003,019,0002,465,792