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 4, 2026 13:49LatentSearchLatentSearchScore: 7,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 13:497,58771,327,99460,732,0002,243,0002,117,632
2Aug 4, 2026 13:497,59571,350,27361,003,0002,037,0002,117,632
3Aug 4, 2026 13:497,61171,588,32360,940,0002,234,0002,117,632
4Aug 4, 2026 13:497,61171,573,27761,117,0002,061,0002,117,632
5Aug 4, 2026 13:497,62071,595,94961,233,0002,017,0002,117,632
6Aug 4, 2026 13:497,62571,727,48861,255,0002,038,0002,117,632
7Aug 4, 2026 13:497,63971,717,78761,337,0002,074,0002,117,632
8Aug 4, 2026 13:497,64071,713,91661,196,0002,218,0002,117,632
9Aug 4, 2026 13:497,65471,868,97961,492,0002,041,0002,117,632