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 13:42Saif Al-HarthiSaif Al-HarthiScore: 20,184Success
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 13:4320,168176,753,521166,393,0001,006,0002,113,536
2Jun 29, 2026 13:4320,175176,770,122166,454,0001,005,0002,113,536
3Jun 29, 2026 13:4320,181176,817,624166,501,0001,003,0002,113,536
4Jun 29, 2026 13:4320,183176,874,775166,516,0001,005,0002,113,536
5Jun 29, 2026 13:4320,184176,768,093166,522,0001,008,0002,113,536
6Jun 29, 2026 13:4320,189176,914,673166,571,0001,004,0002,113,536
7Jun 29, 2026 13:4320,192176,978,451166,592,0001,004,0002,113,536
8Jun 29, 2026 13:4320,262177,510,938167,175,0001,005,0002,113,536
9Jun 29, 2026 13:4321,309186,234,037175,865,0001,005,0002,113,536