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 19:08Dinu GoyalDinu GoyalScore: 54,406Success
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 19:0853,933458,445,754445,548,0002,101,0002,125,824
2Nov 1, 2026 19:0853,987459,123,108447,004,0001,089,0002,125,824
3Nov 1, 2026 19:0854,146460,246,925447,320,0002,100,0002,125,824
4Nov 1, 2026 19:0854,287461,960,291448,472,0002,111,0002,125,824
5Nov 1, 2026 19:0854,406462,963,134449,472,0002,103,0002,125,824
6Nov 1, 2026 19:0854,492463,196,499450,198,0002,091,0002,125,824
7Nov 1, 2026 19:0854,798467,089,435453,763,0001,067,0002,125,824
8Nov 1, 2026 19:0854,855466,137,047453,212,0002,092,0002,125,824
9Nov 1, 2026 19:0854,933466,917,316453,840,0002,106,0002,125,824