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 3, 2026 12:42limanjun99limanjun99Score: 5,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 12:425,55367,879,60442,085,0004,008,0002,424,832
2May 3, 2026 12:425,56662,225,16143,193,0003,013,0002,306,048
3May 3, 2026 12:425,60362,496,73441,563,0004,948,0002,433,024
4May 3, 2026 12:425,60961,121,25942,513,0004,048,0002,445,312
5May 3, 2026 12:425,64160,649,95341,846,0004,981,0002,543,616
6May 3, 2026 12:425,67259,034,15943,072,0004,006,0002,527,232
7May 3, 2026 12:425,70560,299,92243,323,0004,030,0002,416,640
8May 3, 2026 12:425,70563,788,43044,335,0003,022,0002,437,120
9May 3, 2026 12:425,81561,877,91244,248,0004,022,0002,461,696