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 30, 2026 10:10Saif Al-HarthiSaif Al-HarthiScore: 13,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:1013,069117,768,151107,469,0001,010,0002,113,536
2Jun 30, 2026 10:1013,077117,852,377107,532,0001,010,0002,113,536
3Jun 30, 2026 10:1013,081117,858,338107,565,0001,009,0002,113,536
4Jun 30, 2026 10:1013,086117,943,179107,603,0001,014,0002,113,536
5Jun 30, 2026 10:1013,087117,922,422107,617,0001,009,0002,113,536
6Jun 30, 2026 10:1013,102127,131,945107,744,0001,009,0002,113,536
7Jun 30, 2026 10:1013,135128,559,852108,016,0001,012,0002,113,536
8Jun 30, 2026 10:1013,359120,196,812109,873,0001,011,0002,113,536
9Jun 30, 2026 10:1013,456131,792,099110,676,0001,012,0002,113,536