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 22:05TonyTonyScore: 41,855Success
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 22:0541,752354,905,814345,541,0001,002,0002,117,632
2Aug 1, 2026 22:0541,775355,200,656345,736,0001,003,0002,117,632
3Aug 1, 2026 22:0541,832356,555,562346,209,0001,004,0002,117,632
4Aug 1, 2026 22:0541,835356,283,547346,228,0001,003,0002,117,632
5Aug 1, 2026 22:0541,855356,059,577346,399,0001,004,0002,117,632
6Aug 1, 2026 22:0541,862355,893,939346,454,0001,004,0002,117,632
7Aug 1, 2026 22:0541,865355,842,411346,481,0001,003,0002,117,632
8Aug 1, 2026 22:0541,869356,322,801346,515,0001,004,0002,117,632
9Aug 1, 2026 22:0541,872357,329,106346,538,0001,002,0002,117,632