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 listMay 19, 2026 22:23M-RochatM-RochatScore: 30,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 22:2430,291261,373,614250,413,0001,007,0002,117,632
2May 19, 2026 22:2430,302260,740,474250,502,0001,008,0002,117,632
3May 19, 2026 22:2430,307260,896,076250,506,0001,046,0002,117,632
4May 19, 2026 22:2430,310262,808,340250,570,0001,006,0002,117,632
5May 19, 2026 22:2430,321260,822,499250,657,0001,008,0002,117,632
6May 19, 2026 22:2430,326263,881,696250,700,0001,007,0002,117,632
7May 19, 2026 22:2430,328260,999,489250,711,0001,014,0002,117,632
8May 19, 2026 22:2430,336262,839,304250,782,0001,008,0002,117,632
9May 19, 2026 22:2430,364261,266,178251,016,0001,008,0002,117,632