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 listJun 29, 2026 12:24Saif Al-HarthiSaif Al-HarthiScore: 45,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 12:2445,673388,453,057378,083,0001,003,0002,113,536
2Jun 29, 2026 12:2445,685388,424,178378,185,0001,004,0002,113,536
3Jun 29, 2026 12:2445,746389,018,764378,695,0001,005,0002,113,536
4Jun 29, 2026 12:2445,918390,468,658380,119,0001,003,0002,113,536
5Jun 29, 2026 12:2445,945390,702,396380,344,0001,004,0002,113,536
6Jun 29, 2026 12:2445,975390,923,096380,593,0001,003,0002,113,536
7Jun 29, 2026 12:2445,975390,944,641380,593,0001,005,0002,113,536
8Jun 29, 2026 12:2445,976390,901,752380,599,0001,005,0002,113,536
9Jun 29, 2026 12:2445,993390,994,312380,738,0001,005,0002,113,536