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 24, 2026 22:02Victor MerckléVictor MerckléScore: 3,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 22:033,93340,996,77931,440,0001,204,0002,117,632stderr
2Aug 24, 2026 22:033,93941,096,03931,512,0001,187,0002,117,632stderr
3Aug 24, 2026 22:033,94541,095,23531,724,0001,020,0002,117,632stderr
4Aug 24, 2026 22:033,95441,704,61731,803,0001,020,0002,117,632stderr
5Aug 24, 2026 22:033,95641,219,04031,820,0001,017,0002,117,632stderr
6Aug 24, 2026 22:033,97241,380,01731,784,0001,190,0002,117,632stderr
7Aug 24, 2026 22:033,97342,090,73131,961,0001,018,0002,117,632stderr
8Aug 24, 2026 22:034,01641,731,15432,318,0001,020,0002,117,632stderr
9Aug 24, 2026 22:034,02641,851,94732,215,0001,201,0002,117,632stderr