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 listJul 2, 2026 18:22A_ShamanA_ShamanScore: 38,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 18:2338,414328,880,615316,816,0002,024,0002,113,536
2Jul 2, 2026 18:2338,449330,516,269317,123,0002,005,0002,113,536
3Jul 2, 2026 18:2338,453328,842,115317,147,0002,014,0002,113,536
4Jul 2, 2026 18:2338,462329,239,602317,202,0002,035,0002,113,536
5Jul 2, 2026 18:2338,468328,918,726318,286,0001,004,0002,113,536
6Jul 2, 2026 18:2338,487329,464,731317,368,0002,081,0002,113,536
7Jul 2, 2026 18:2338,489328,993,109318,454,0001,006,0002,113,536
8Jul 2, 2026 18:2338,499329,111,386317,457,0002,086,0002,113,536
9Jul 2, 2026 18:2338,530329,854,293317,792,0002,010,0002,113,536