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 listSep 23, 2026 17:14parastromparastromScore: 5,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 17:165,63557,125,58645,735,0001,039,0002,113,536
2Sep 23, 2026 17:165,64757,237,31345,828,0001,046,0002,113,536
3Sep 23, 2026 17:165,66357,307,24045,798,0001,211,0002,113,536
4Sep 23, 2026 17:165,69957,931,86346,189,0001,116,0002,113,536
5Sep 23, 2026 17:165,70257,737,45646,208,0001,122,0002,113,536
6Sep 23, 2026 17:165,70657,797,35546,235,0001,126,0002,113,536
7Sep 23, 2026 17:165,72357,848,82246,386,0001,123,0002,113,536
8Sep 23, 2026 17:165,72557,844,53546,407,0001,118,0002,113,536
9Sep 23, 2026 17:165,72657,819,99046,412,0001,120,0002,113,536