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 06:23Md Nafis Ul Haque ShifatMd Nafis Ul Haque ShifatScore: 5,752Success
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 06:235,70658,070,45044,284,0003,076,00020,480
2Nov 1, 2026 06:235,72458,284,54344,038,0003,475,0002,113,536
3Nov 1, 2026 06:235,74658,375,58744,320,0003,377,00020,480
4Nov 1, 2026 06:235,74658,428,22044,434,0003,266,00020,480
5Nov 1, 2026 06:235,75258,387,76444,497,0003,250,0002,113,536
6Nov 1, 2026 06:235,78958,760,17744,569,0003,486,0002,113,536
7Nov 1, 2026 06:235,79658,762,12044,794,0003,314,0002,113,536
8Nov 1, 2026 06:235,81658,949,02944,979,0003,295,00020,480
9Nov 1, 2026 06:235,91261,102,54844,979,0004,096,0002,113,536