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 listAug 30, 2025 21:37Adam FolwarcznyAdam FolwarcznyScore: 9,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 21:379,720105,465,93046,811,00033,863,0002,412,544
2Aug 30, 2025 21:379,797118,082,86152,558,00028,758,0002,396,160
3Aug 30, 2025 21:379,824107,144,27951,707,00029,831,0002,404,352
4Aug 30, 2025 21:379,859113,470,78151,266,00030,562,0002,408,448
5Aug 30, 2025 21:379,891111,378,70651,431,00030,661,0002,404,352
6Aug 30, 2025 21:379,892112,326,53351,436,00030,664,0002,465,792
7Aug 30, 2025 21:379,894105,956,43951,450,00030,672,0002,416,640
8Aug 30, 2025 21:379,910106,829,79350,543,00031,713,0002,400,256
9Aug 30, 2025 21:379,932117,397,22950,652,00031,781,0002,396,160
10Aug 30, 2025 21:379,982112,616,32149,316,00033,535,0002,498,560
11Aug 30, 2025 21:3710,044107,765,46645,652,00037,712,0002,465,792
12Aug 30, 2025 21:3710,175115,414,23949,678,00034,774,0002,539,520