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 listJan 31, 2026 18:01olliecrowolliecrowScore: 7,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 18:016,64382,195,91651,125,0004,009,0002,412,544
2Jan 31, 2026 18:016,72480,961,22653,817,0001,993,0002,371,584
3Jan 31, 2026 18:016,77184,775,44353,188,0003,010,0002,383,872
4Jan 31, 2026 18:017,00383,718,22255,123,0003,006,0002,412,544
5Jan 31, 2026 18:017,01788,683,94856,232,0002,008,0002,351,104
6Jan 31, 2026 18:017,03189,613,07756,348,0002,012,0002,473,984