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 listMar 15, 2026 19:40Eric CeglieEric CeglieScore: 14,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:4014,241141,023,318111,191,0007,012,0002,334,720
2Mar 15, 2026 19:4014,278149,161,297108,549,0009,958,0002,322,432
3Mar 15, 2026 19:4014,286144,384,864110,533,0008,038,0002,277,376
4Mar 15, 2026 19:4014,344143,665,679107,047,00012,005,0002,277,376
5Mar 15, 2026 19:4014,352143,563,539112,115,0007,007,0002,314,240
6Mar 15, 2026 19:4014,356141,868,496107,140,00012,015,0002,277,376
7Mar 15, 2026 19:4014,380143,464,617106,317,00013,038,0002,412,544
8Mar 15, 2026 19:4014,443148,563,364111,887,0007,991,0002,269,184
9Mar 15, 2026 19:4014,637146,758,533113,457,0008,032,0002,428,928