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 1, 2026 08:57limanjun99limanjun99Score: 17,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 08:5817,157158,934,486140,399,0002,005,0002,338,816
2May 1, 2026 08:5817,164163,182,327140,463,0002,006,0002,510,848
3May 1, 2026 08:5817,307161,059,000140,664,0002,992,0002,502,656
4May 1, 2026 08:5817,326159,730,279140,814,0002,996,0002,506,752
5May 1, 2026 08:5817,329161,474,785140,839,0002,996,0002,510,848
6May 1, 2026 08:5817,330164,358,718140,843,0002,996,0002,510,848
7May 1, 2026 08:5817,336161,858,392140,895,0002,997,0002,498,560
8May 1, 2026 08:5817,337158,831,557140,903,0002,997,0002,347,008
9May 1, 2026 08:5817,351162,296,281141,017,0003,000,0002,527,232