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 23:49Mikołaj UzarskiMikołaj UzarskiScore: 5,781Success
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 23:495,73678,372,70841,532,0006,077,0002,486,272
2Feb 18, 2026 23:495,78172,308,54740,988,0006,998,0002,424,832
3Feb 18, 2026 23:495,81269,889,45743,212,0005,024,0002,416,640