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 listMar 12, 2026 16:56Sergey SerebryakovSergey SerebryakovScore: 7,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 16:567,04080,103,92857,429,0001,007,0002,445,312
2Mar 12, 2026 16:567,05482,423,96357,540,0001,009,0002,277,376
3Mar 12, 2026 16:567,05684,082,61557,558,0001,009,0002,445,312
4Mar 12, 2026 16:567,49788,732,37860,217,0002,007,0002,277,376
5Mar 12, 2026 16:567,50285,931,31961,260,0001,004,0002,445,312
6Mar 12, 2026 16:567,51988,558,18561,404,0001,006,0002,277,376