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 listNov 1, 2026 18:48Dinu GoyalDinu GoyalScore: 56,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 18:4955,957475,902,488454,007,00010,439,00020,480
2Nov 1, 2026 18:4956,155477,220,819454,107,00011,983,00020,480
3Nov 1, 2026 18:4956,339478,353,887456,540,00011,076,00020,480
4Nov 1, 2026 18:4956,340478,823,983456,150,00011,475,00020,480
5Nov 1, 2026 18:4956,347478,430,268455,637,00012,047,00020,480
6Nov 1, 2026 18:4956,358479,025,325456,401,00011,371,0002,113,536
7Nov 1, 2026 18:4956,480479,562,321456,656,00012,130,00020,480
8Nov 1, 2026 18:4957,003483,801,362462,416,00010,711,00020,480
9Nov 1, 2026 18:4957,108484,742,463462,333,00011,671,00020,480