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 listApr 30, 2026 20:37Dibash ThapaDibash ThapaScore: 62,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 20:3761,977530,582,122453,368,00061,049,0002,342,912
2Apr 30, 2026 20:3762,022534,811,173454,810,00059,975,0002,342,912
3Apr 30, 2026 20:3762,057531,544,138451,065,00064,009,0002,342,912
4Apr 30, 2026 20:3762,078529,233,903452,221,00063,030,0002,408,448
5Apr 30, 2026 20:3762,080532,741,916453,234,00062,032,0002,351,104
6Apr 30, 2026 20:3762,106538,041,262456,432,00059,055,0002,351,104
7Apr 30, 2026 20:3762,113535,363,492452,600,00062,944,0002,347,008
8Apr 30, 2026 20:3762,126535,315,843450,691,00064,955,0002,347,008
9Apr 30, 2026 20:3762,173534,545,019452,033,00064,004,0002,326,528