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 listFeb 18, 2026 22:32wnwnScore: 5,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 22:325,49968,145,43844,647,000992,0002,445,312
2Feb 18, 2026 22:325,51670,822,20744,789,000995,0002,539,520
3Feb 18, 2026 22:325,52069,387,04043,827,0001,992,0002,441,216
4Feb 18, 2026 22:325,52667,550,50743,868,0001,994,0002,539,520
5Feb 18, 2026 22:325,52767,909,53044,876,000997,0002,449,408
6Feb 18, 2026 22:325,54470,936,91844,013,0002,000,0002,449,408
7Feb 18, 2026 22:325,54868,953,74144,045,0002,002,0002,527,232
8Feb 18, 2026 22:325,55067,278,43344,064,0002,002,0002,437,120
9Feb 18, 2026 22:325,65573,667,23544,941,0001,997,0002,539,520