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 25, 2026 13:54Victor MerckléVictor MerckléScore: 6,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 13:556,77166,001,80955,128,0001,074,0002,117,632stderr
2Aug 25, 2026 13:556,77564,669,92555,225,0001,008,0002,117,632stderr
3Aug 25, 2026 13:556,78664,702,41255,310,0001,021,0002,117,632stderr
4Aug 25, 2026 13:556,78764,776,38355,308,0001,026,0002,117,632stderr
5Aug 25, 2026 13:556,80964,910,92055,493,0001,025,0002,117,632stderr
6Aug 25, 2026 13:556,81264,940,41655,511,0001,036,0002,117,632stderr
7Aug 25, 2026 13:556,84265,225,28655,756,0001,038,0002,117,632stderr
8Aug 25, 2026 13:556,86565,399,92955,961,0001,022,0002,117,632stderr
9Aug 25, 2026 13:556,89865,664,59256,232,0001,028,0002,117,632stderr