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 listMay 9, 2026 14:39wnwnScore: 3,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:403,37342,318,77526,929,0001,068,0002,486,272
2May 9, 2026 14:403,37540,491,72726,981,0001,039,0002,482,176
3May 9, 2026 14:403,37643,448,96926,958,0001,065,0002,482,176
4May 9, 2026 14:403,38143,638,62627,004,0001,061,0002,482,176
5May 9, 2026 14:403,38442,837,41327,056,0001,038,0002,482,176
6May 9, 2026 14:403,39147,171,16027,025,0001,121,0002,494,464
7May 9, 2026 14:403,39943,446,22227,161,0001,057,0002,494,464
8May 9, 2026 14:403,40344,780,89927,187,0001,063,0002,482,176
9May 9, 2026 14:403,49943,225,39927,970,0001,078,0002,490,368