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 listJun 29, 2026 08:14Adam FolwarcznyAdam FolwarcznyScore: 56,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 08:1456,665480,172,293469,175,0001,152,0002,113,536
2Jun 29, 2026 08:1456,666479,711,514469,191,0001,143,0002,113,536
3Jun 29, 2026 08:1456,669479,680,614469,207,0001,151,0002,113,536
4Jun 29, 2026 08:1456,673479,697,405469,247,0001,143,0002,113,536
5Jun 29, 2026 08:1456,794480,721,499470,376,0001,020,0002,113,536
6Jun 29, 2026 08:1456,826481,037,478470,644,0001,018,0002,113,536
7Jun 29, 2026 08:1456,835481,098,034470,573,0001,162,0002,113,536
8Jun 29, 2026 08:1456,838481,112,018470,715,0001,047,0002,113,536
9Jun 29, 2026 08:1456,846481,156,983470,803,0001,025,0002,113,536