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 listJul 7, 2026 08:50Teow Hua JunTeow Hua JunScore: 11,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 08:5011,621105,858,72395,445,0001,016,0002,113,536
2Jul 7, 2026 08:5011,633106,076,23195,542,0001,017,0002,113,536
3Jul 7, 2026 08:5011,640106,054,25395,599,0001,017,0002,113,536
4Jul 7, 2026 08:5011,654106,201,35695,719,0001,017,0002,113,536
5Jul 7, 2026 08:5011,654106,151,62895,715,0001,016,0002,113,536
6Jul 7, 2026 08:5011,657106,196,44395,739,0001,017,0002,113,536
7Jul 7, 2026 08:5011,679106,565,52595,921,0001,018,0002,113,536
8Jul 7, 2026 08:5011,828107,683,61997,159,0001,015,0002,113,536
9Jul 7, 2026 08:5011,843109,389,28997,287,0001,017,0002,113,536