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 listMay 14, 2025 08:14Emanuele BolognesiEmanuele BolognesiScore: 63,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2025 08:1463,898559,839,893529,352,0001,000,0002,285,568
2May 14, 2025 08:1463,902557,298,866529,389,0001,000,0002,355,200
3May 14, 2025 08:1463,920553,210,525528,542,0001,998,0002,363,392
4May 14, 2025 08:1463,924563,271,904528,575,0001,998,0002,363,392
5May 14, 2025 08:1463,925559,067,320529,582,000999,0002,363,392
6May 14, 2025 08:1463,925560,776,265528,583,0001,998,0002,285,568
7May 14, 2025 08:1463,926556,893,844529,583,000999,0002,363,392
8May 14, 2025 08:1463,928556,242,302528,601,0001,998,0002,285,568
9May 14, 2025 08:1463,942559,125,345528,723,0001,998,0002,285,568