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 2, 2025 20:37Jack FrigaardJack FrigaardScore: 4,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:374,68065,709,04135,857,0002,988,0002,473,984
2Aug 2, 2025 20:374,68463,307,77235,890,0002,990,0002,285,568
3Aug 2, 2025 20:374,69064,513,45135,935,0002,994,0002,465,792
4Aug 2, 2025 20:374,76364,323,29437,507,0002,027,0002,285,568
5Aug 2, 2025 20:374,77066,289,71838,574,0001,015,0002,461,696
6Aug 2, 2025 20:374,78165,331,51437,647,0002,035,0002,478,080