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 28, 2026 00:33A_ShamanA_ShamanScore: 38,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 00:3338,254326,918,351316,509,0001,003,0002,113,536
2Jun 28, 2026 00:3338,256327,311,960316,528,0001,004,0002,113,536
3Jun 28, 2026 00:3338,258326,882,554316,539,0001,003,0002,113,536
4Jun 28, 2026 00:3338,258326,922,831316,523,0001,025,0002,113,536
5Jun 28, 2026 00:3338,259327,028,037316,539,0001,014,0002,113,536
6Jun 28, 2026 00:3338,261326,905,189316,570,0001,003,0002,113,536
7Jun 28, 2026 00:3338,264327,155,600316,594,0001,004,0002,113,536
8Jun 28, 2026 00:3338,268327,066,534316,628,0001,004,0002,113,536
9Jun 28, 2026 00:3338,283327,121,494316,745,0001,006,0002,113,536