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 listAug 5, 2026 06:26C21C21Score: 56,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 06:2755,537471,148,100459,814,0001,147,0002,113,536
2Aug 5, 2026 06:2755,554471,112,846459,903,0001,196,0002,113,536
3Aug 5, 2026 06:2755,919474,894,163463,127,0001,003,0002,113,536
4Aug 5, 2026 06:2755,987474,716,126463,693,0001,003,0002,113,536
5Aug 5, 2026 06:2756,433478,517,000467,379,0001,020,0002,113,536
6Aug 5, 2026 06:2756,615480,020,383468,904,0001,001,0002,113,536
7Aug 5, 2026 06:2756,768481,327,688470,175,0001,001,0002,113,536
8Aug 5, 2026 06:2756,774481,244,781470,054,0001,171,0002,113,536
9Aug 5, 2026 06:2756,775481,271,933470,046,0001,190,0002,113,536