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 listJan 9, 2026 22:08Alexander FrolovAlexander FrolovScore: 46,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 22:0846,410404,004,073384,207,0001,000,0002,273,280
2Jan 9, 2026 22:0846,819412,130,466386,604,0001,997,0002,535,424
3Jan 9, 2026 22:0846,823414,968,625386,635,0001,998,0002,494,464
4Jan 9, 2026 22:0846,826412,517,386386,655,0001,998,0002,277,376
5Jan 9, 2026 22:0846,828411,961,022386,674,0001,998,0002,277,376
6Jan 9, 2026 22:0846,837416,488,517386,748,0001,998,0002,277,376
7Jan 9, 2026 22:0846,957411,051,938387,744,0001,998,0002,486,272
8Jan 9, 2026 22:0846,966416,518,163387,819,0001,999,0002,486,272
9Jan 9, 2026 22:0846,968412,518,364387,833,0001,999,0002,277,376