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 listNov 4, 2025 18:10caandocaandoScore: 5,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 18:105,78870,271,23146,039,0002,001,0002,285,568
2Nov 4, 2025 18:105,79371,796,74746,078,0002,003,0002,285,568
3Nov 4, 2025 18:105,79477,136,24747,087,0001,001,0002,285,568
4Nov 4, 2025 18:105,80373,170,43346,159,0002,006,0002,523,136
5Nov 4, 2025 18:105,82274,003,27346,312,0002,013,0002,285,568
6Nov 4, 2025 18:105,82770,652,69747,358,0001,007,0002,285,568
7Nov 4, 2025 18:105,83274,065,26446,391,0002,017,0002,523,136
8Nov 4, 2025 18:105,85675,815,09048,603,00002,285,568
9Nov 4, 2025 18:105,85977,202,06447,617,0001,013,0002,285,568
10Nov 4, 2025 18:105,97184,570,81649,563,00002,523,136
11Nov 4, 2025 18:105,97875,021,74049,620,00002,265,088
12Nov 4, 2025 18:105,98377,946,56548,642,0001,013,0002,285,568