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 2, 2026 06:37Andrey TsvetkovAndrey TsvetkovScore: 40,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 06:3940,411346,764,148333,277,0002,136,0002,138,112
2Aug 2, 2026 06:3940,418346,996,277333,409,0002,068,0002,138,112
3Aug 2, 2026 06:3940,423346,786,022333,396,0002,120,0002,138,112
4Aug 2, 2026 06:3940,430346,294,689333,363,0002,213,0002,138,112
5Aug 2, 2026 06:3940,430346,829,476333,430,0002,144,0002,138,112
6Aug 2, 2026 06:3940,430346,982,045333,404,0002,167,0002,138,112
7Aug 2, 2026 06:3940,442346,813,471333,492,0002,177,0002,138,112
8Aug 2, 2026 06:3940,448347,700,251333,563,0002,163,0002,138,112
9Aug 2, 2026 06:3940,463346,923,149332,533,0003,312,0002,138,112