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 listJul 7, 2026 17:34Jarry XiaoJarry XiaoScore: 36,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:3536,486312,948,712301,833,0001,005,0002,129,920
2Jul 7, 2026 17:3536,486312,425,723301,833,0001,004,0002,129,920
3Jul 7, 2026 17:3536,491312,488,370300,751,0002,125,0002,129,920
4Jul 7, 2026 17:3536,493312,459,893301,889,0001,003,0002,129,920
5Jul 7, 2026 17:3536,497312,528,116301,924,0001,007,0002,129,920
6Jul 7, 2026 17:3536,499312,499,230301,944,0001,004,0002,129,920
7Jul 7, 2026 17:3536,502312,552,147300,814,0002,157,0002,129,920
8Jul 7, 2026 17:3536,511312,602,146302,044,0001,005,0002,129,920
9Jul 7, 2026 17:3537,004316,674,723305,001,0002,133,0002,129,920