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 listJun 8, 2025 23:54Hayk KarapetyanHayk KarapetyanScore: 67,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2025 23:5467,092580,257,721494,880,00061,985,0002,289,664
2Jun 8, 2025 23:5467,137580,632,880489,208,00068,029,0002,289,664
3Jun 8, 2025 23:5467,145585,609,194501,276,00056,030,0002,449,408
4Jun 8, 2025 23:5467,158586,929,941495,367,00062,045,0002,289,664
5Jun 8, 2025 23:5467,181585,699,650510,638,00046,966,0002,289,664
6Jun 8, 2025 23:5467,221585,987,776498,945,00058,993,0002,289,664
7Jun 8, 2025 23:5467,227585,542,487497,988,00059,998,0002,445,312
8Jun 8, 2025 23:5467,327587,389,090490,837,00067,977,0002,457,600
9Jun 8, 2025 23:5467,491588,936,566512,158,00048,014,0002,289,664