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 25, 2026 06:19wnwnScore: 3,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 06:203,39035,610,25927,106,0001,032,0002,113,536
2Jun 25, 2026 06:203,40536,081,77027,261,0001,006,0002,113,536
3Jun 25, 2026 06:203,43436,171,64627,472,0001,035,0002,113,536
4Jun 25, 2026 06:203,44136,133,20227,561,0001,007,0002,113,536
5Jun 25, 2026 06:203,44636,309,22527,599,0001,009,0002,113,536
6Jun 25, 2026 06:203,44836,463,85227,599,0001,020,0002,113,536
7Jun 25, 2026 06:203,46836,948,48927,745,0001,043,0002,113,536
8Jun 25, 2026 06:203,46936,643,88527,781,0001,015,0002,113,536
9Jun 25, 2026 06:203,48136,783,25327,852,0001,043,0002,113,536