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 1, 2026 23:17TonyTonyScore: 41,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:1741,768354,993,098345,674,0001,003,0002,117,632
2Aug 1, 2026 23:1741,786355,319,062345,822,0001,004,0002,117,632
3Aug 1, 2026 23:1741,796355,503,424345,910,0001,004,0002,117,632
4Aug 1, 2026 23:1741,800355,504,665345,939,0001,003,0002,117,632
5Aug 1, 2026 23:1741,807355,348,042345,998,0001,004,0002,117,632
6Aug 1, 2026 23:1741,808355,466,489346,005,0001,002,0002,117,632
7Aug 1, 2026 23:1741,818355,652,532346,088,0001,003,0002,117,632
8Aug 1, 2026 23:1741,819355,528,159346,102,0001,002,0002,117,632
9Aug 1, 2026 23:1741,836355,537,977346,240,0001,004,0002,117,632