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 30, 2026 21:32Josu San MartinJosu San MartinScore: 4,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:324,26343,815,66934,343,0001,044,0002,113,536
2Aug 30, 2026 21:324,26443,907,60734,345,0001,050,0002,113,536
3Aug 30, 2026 21:324,26543,848,88834,375,0001,028,0002,113,536
4Aug 30, 2026 21:324,26743,850,55134,379,0001,042,0002,113,536
5Aug 30, 2026 21:324,27143,866,13134,417,0001,036,0002,113,536
6Aug 30, 2026 21:324,27644,025,52534,450,0001,043,0002,113,536
7Aug 30, 2026 21:324,28144,043,69434,422,0001,112,0002,113,536
8Aug 30, 2026 21:324,29944,191,97134,566,0001,119,0002,113,536
9Aug 30, 2026 21:324,32944,491,72334,877,0001,057,0002,113,536