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 7, 2026 22:10Pavel SkripkinPavel SkripkinScore: 79,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 22:1079,580685,040,653428,684,000231,829,0002,469,888
2Jan 7, 2026 22:1079,707686,778,751425,725,000235,847,0002,498,560
3Jan 7, 2026 22:1079,848687,753,894426,834,000235,908,0002,465,792