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 listOct 15, 2026 19:07timothygktimothygkScore: 44,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 19:0744,235377,606,968361,885,0005,267,0002,117,632stderr
2Oct 15, 2026 19:0744,310378,253,689361,955,0005,821,00024,576stderr
3Oct 15, 2026 19:0744,330378,467,607362,258,0005,682,00024,576stderr
4Oct 15, 2026 19:0744,407379,062,936363,160,0005,426,00024,576stderr
5Oct 15, 2026 19:0744,418379,141,710362,885,0005,789,00024,576stderr
6Oct 15, 2026 19:0744,433379,201,274363,204,0005,598,00024,576stderr
7Oct 15, 2026 19:0744,496379,875,783363,510,0005,812,00024,576stderr
8Oct 15, 2026 19:0744,506379,844,618362,607,0006,797,00024,576stderr
9Oct 15, 2026 19:0746,238394,221,249377,501,0006,277,00024,576stderr