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 11:18Adam FolwarcznyAdam FolwarcznyScore: 11,523Success
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 11:1810,78999,517,72085,438,0004,113,0002,117,632stderr
2Jun 29, 2026 11:1811,490104,868,54692,314,0003,055,0002,117,632stderr
3Jun 29, 2026 11:1811,509105,410,92991,449,0004,082,0002,117,632stderr
4Jun 29, 2026 11:1811,519105,558,87291,514,0004,101,0002,117,632stderr
5Jun 29, 2026 11:1811,523105,572,47391,483,0004,158,0002,117,632stderr
6Jun 29, 2026 11:1811,539105,731,12891,704,0004,072,0002,117,632stderr
7Jun 29, 2026 11:1811,559105,940,42591,705,0004,239,0002,117,632stderr
8Jun 29, 2026 11:1811,580105,622,06392,894,0003,224,0002,117,632stderr
9Jun 29, 2026 11:1811,615106,327,19392,228,0004,180,0002,117,632stderr